Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
نویسندگان
چکیده
منابع مشابه
Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
This paper presents a branch–and–price algorithm for the Capacitated Hub Location Problem with Single Assignment, in which Lagrangean relaxation is used to obtain tight lower bounds of the Restricted Master Problem (RPM). It is shown how to solve the pricing problem for finding new columns to be added to the RMP, or for proving that the lower bound of the current RMP is valid. Also, a lower bou...
متن کاملA branch and cut algorithm for hub location problems with single assignment
The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and...
متن کاملCapacitated Single-Assignment Hub Covering Location Problem under Fuzzy Environment
This paper studies capacitated single-allocation hub covering location problem with fuzzy cover radius and travel time. Objective of hub covering problem is to find the minimum number of hubs considering the maximum allowable travel time. Computational results show that due to uncertainty, number of hubs and the allocation of non-hub nodes to hub nodes are changed. This paper proposes heuristic...
متن کاملBranch-and-Cut-and-Price for Capacitated Connected Facility Location
We consider a generalization of the Connected Facility Location problem (ConFL), suitable to model real world network extension scenarios such as fiber-tothe-curb. In addition to choosing a set of facilities and connecting them by a Steiner tree as in ConFL, we aim to maximize the resulting profit by potentially supplying only a subset of all customers. Furthermore, capacity constraints on pote...
متن کاملAn effective heuristic for large-scale capacitated facility location problems
The Capacitated Facility Location Problem (CFLP) consists of locating a set of facilities with capacity constraints to satisfy the demands of a set of clients at the minimum cost. In this paper we propose a simple and effective heuristic for largescale instances of CFLP. The heuristic is based on a Lagrangean relaxation which is used to select a subset of “promising” variables forming the core ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2011
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.1100.0391